Security improvements of several basic quantum private query protocols with O(log N) communication complexity
نویسندگان
چکیده
منابع مشابه
Quantum Communication Complexity of Quantum Authentication Protocols
In order to perform Quantum Cryptography procedures it is often essencial to ensure that the parties of the communication are authentic. Such task is accomplished by quantum authentication protocols which are distributed algorithms based on the intrinsic properties of Quantum Mechanics. The choice of an authentication protocol must consider that quantum states are very delicate and that the cha...
متن کاملOn the Security of Protocols with Logarithmic Communication Complexity
We investigate the security of protocols with logarithmic communication complexity. We show that for the security definitions with environment, i.e., Reactive Simulatability and Universal Composability, computational security of logarithmic protocols implies statistical security. The same holds for advantage-based security definitions as commonly used for individual primitives. While this match...
متن کاملExperimental requirements for quantum communication complexity protocols
I present a simple two-party quantum communication complexity protocol with higher success rate than the best possible classical protocol for the same task. The quantum protocol is shown to be equivalent to a quantum non-locality test, except that it is not necessary to close the locality loophole. I derive bounds for the detector efficiency and background count rates necessary for an experimen...
متن کاملCharacterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the non-deterministic quantum query complexity of f is linearly related to the degree of a “non-deterministic” polynomial for f . We also prove a quantum-classical...
متن کاملQuantum Private Information Retrieval with Sublinear Communication Complexity
This note presents a quantum protocol for private information retrieval, in the case of a single (honest) server and with information-theoretical privacy, that has O( √ n)qubit communication complexity, where n denotes the size of the database. In comparison, it is known that any classical protocol must use Ω(n) bits of communication in this setting. ACM Classification: F.2.3 AMS Classification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.12.008